Chapter 21 Approximating a Convex Body by An Ellipsoid
نویسنده
چکیده
x " Is there anything in the Geneva Convention about the rules of war in peacetime? " Stalnko wanted to know, crawling back toward the truck. " Absolutely nothing, " Caulec assured him. " The rules of war apply only in wartime. In peacetime, anything goes. " – Gasp, Romain Gary. In this chapter, we show that any convex body can be approximated " reasonably well " by an ellipsoid. (A quick reminder of linear algebra and the notations we use is provided in Section 21.4 p267 .)
منابع مشابه
Improved Complexity for Maximum Volume Inscribed Ellipsoids
Let P = fx j Ax bg, where A is an m n matrix. We assume that P contains a ball of radius one centered at the origin, and is contained in a ball of radius R centered at the origin. We consider the problem of approximating the maximum volume ellipsoid inscribed in P. Such ellipsoids have a number of interesting applications, including the inscribed ellipsoid method for convex optimization. We red...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملComputing Mixed Discriminants , Mixed Volumes
We construct a probabilistic polynomial time algorithm that computes the mixed discriminant of given n positive definite n × n matrices within a 2O(n) factor. As a corollary, we show that the permanent of an n×n nonnegative matrix and the mixed volume of n ellipsoids inRn can be computed within a 2O(n) factor by probabilistic polynomial time algorithms. Since every convex body can be approximat...
متن کاملGeometrie Algorithms and Algorithmic Geometry
In this paper I would like to illustrate two facts. First, that ideas borrowed from convex, projective, and other classical branches of geometry play an important role in the design of algorithms for problems that do not seem to have anything to do with geometry: for problems in optimization, combinatorics, algebra, and number theory. Second, that such applications of geometry suggest some very...
متن کاملOn Self-Concordant Convex-Concave Functions
In this paper, we introduce the notion of a self-concordant convex-concave function, establish basic properties of these functions and develop a path-following interior point method for approximating saddle points of “good enough” convex-concave functions – those which admit natural self-concordant convex-concave regularizations. The approach is illustrated by its applications to developing an ...
متن کامل